Indecomposable 1-factorizations of the complete multigraph

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fair 1-Factorizations and Fair Holey 1-Factorizations of Complete Multipartite Graphs

A k-factor of a graph G is a k-regular spanning subgraph of G. A k-factorization is a partition of E(G) into k-factors. Let K(n, p) be the complete multipartite graph with p parts, each of size n. If V1, ..., Vp are the p parts of V (K(n, p)), then a holey k-factor of deficiency Vi of K(n, p) is a k-factor of K(n, p)− Vi for some i satisfying 1 ≤ i ≤ p. Hence a holey k-factorization is a set of...

متن کامل

Factorizations of complete multigraphs

In this paper, several general results are obtained on the Oberwolfach problem that provide isomorphic 2-factorizations of 2Kn. One consequence of these results is that the existence of a 2-factorization in which each 2-factor of 2Kn consists of one cycle of length x and one of length n-x is completely settled. The techniques used to obtain these results are novel, using for example the Lindner...

متن کامل

New infinite classes of 1-factorizations of complete graphs

Some classes of I-factorizations of complete graphs are known. They are GK2n , AK2n , W K 2n and their variations, and automorphism-free I-factorizations. In this paper, for any positive integer t, we construct new I-factorizations NtK 2n which are defined for all 2n with 2n ~ 6t. They also have some variations.

متن کامل

Sharply Transitive 1-Factorizations of Complete Multipartite Graphs

Given a finite group G of even order, which graphs Γ have a 1−factorization admitting G as automorphism group with a sharply transitive action on the vertex-set? Starting from this question, we prove some general results and develop an exhaustive analysis when Γ is a complete multipartite graph and G is cyclic.

متن کامل

Primitive 2-factorizations of the complete graph

LetF be a 2-factorization of the complete graphKv admitting an automorphism groupG acting primitively on the set of vertices. IfF consists of Hamiltonian cycles, thenF is the unique, up to isomorphisms, 2-factorization ofKpn admitting an automorphism group which acts 2-transitively on the vertex-set, see [A. Bonisoli, M. Buratti, G. Mazzuoccolo, Doubly transitive 2-factorizations, J. Combin.Des...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics

سال: 1985

ISSN: 0263-6115

DOI: 10.1017/s1446788700026100